Integer Laplacian eigenvalues of chordal graphs
نویسندگان
چکیده
In this paper, structural properties of chordal graphs are studied, establishing a relationship between these structures and integer Laplacian eigenvalues. We present the characterization with equal vertex algebraic connectivities, by means vertices that compose minimal separators graph; we stablish sufficient condition for cardinality maximal clique to appear as an eigenvalue. Finally, review two subclasses graphs, showing particular properties.
منابع مشابه
Bounds on normalized Laplacian eigenvalues of graphs
*Correspondence: [email protected] 1School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, Fujian, P.R. China 2Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, P.R. China Full list of author information is available at the end of the article Abstract Let G be a simple connected graph of order n, where n≥ 2. Its normalized Laplacian eigenvalues are 0 = λ1 ...
متن کاملSignless Laplacian eigenvalues and circumference of graphs
In this paper, we investigate the relation between the Q -spectrum and the structure of G in terms of the circumference of G. Exploiting this relation, we give a novel necessary condition for a graph to be Hamiltonian by means of its Q -spectrum. We also determine the graphs with exactly one or two Q -eigenvalues greater than or equal to 2 and obtain all minimal forbidden subgraphs and maximal ...
متن کاملSome remarks on Laplacian eigenvalues and Laplacian energy of graphs
Suppose μ1, μ2, ... , μn are Laplacian eigenvalues of a graph G. The Laplacian energy of G is defined as LE(G) = ∑n i=1 |μi − 2m/n|. In this paper, some new bounds for the Laplacian eigenvalues and Laplacian energy of some special types of the subgraphs of Kn are presented. AMS subject classifications: 05C50
متن کاملGraphs with four distinct Laplacian eigenvalues
In this paper, we investigate connected nonregular graphs with four distinct Laplacian eigenvalues. We characterize all such graphs which are bipartite or have exactly one multiple Laplacian eigenvalue. Other examples of interest are also presented.
متن کاملLow Eigenvalues of Laplacian Matrices of Large Random Graphs
Abstract For each n ≥ 2, let An = (ξij) be an n × n symmetric matrix with diagonal entries equal to zero and the entries in the upper triangular part being independent with mean μn and standard deviation σn. The Laplacian matrix is defined by ∆n = diag( ∑n j=1 ξij)1≤i≤n − An. In this paper, we obtain the laws of large numbers for λn−k(∆n), the (k+ 1)-th smallest eigenvalue of ∆n, through the st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2019.12.030